Boundary Crossing Random Walks, Clinical Trials, and Multinomial Sequential Estimation
نویسندگان
چکیده
منابع مشابه
Saddlepoint Approximations and Nonlinear Boundary Crossing Probabilities of Markov Random Walks by Hock
Saddlepoint approximations are developed for Markov random walks Sn and are used to evaluate the probability that (j − i)g((Sj − Si)/(j − i)) exceeds a threshold value for certain sets of (i, j). The special case g(x) = x reduces to the usual scan statistic in change-point detection problems, and many generalized likelihood ratio detection schemes are also of this form with suitably chosen g. W...
متن کاملRandom Walks with Drift - a Sequential Approach
In this paper sequential monitoring schemes to detect nonparametric drifts are studied for the random walk case. The procedure is based on a kernel smoother. As a by-product we obtain the asymptotics of the Nadaraya-Watson estimator and its associated sequential partial sum process under non-standard sampling. The asymptotic behavior differs substantially from the stationary situation, if there...
متن کاملLevel Crossing Probabilities I: One-dimensional Random Walks and Symmetrization
Abstract. We prove for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n is O(n). Moment or symmetry assumptions are not necessary. In removing symmetry the (sharp) inequality P (|X+Y | ≤ 1) < 2P (|X−Y | ≤ 1) for independent identically distributed X, Y is used. In part II we shall discuss the connection of this resul...
متن کاملLevel Crossing Probabilities Ii: Polygonal Recurrence of Multidimensional Random Walks
In part I (math.PR/0406392) we proved for an arbitrary onedimensional random walk with independent increments that the probability of crossing a level at a given time n is O(n). In higher dimensions we call a random walk ’polygonally recurrent’ (resp. transient) if a.s. infinitely many (resp. finitely many) of the straight lines between two consecutive sites hit a given bounded set. The above e...
متن کاملSteady State Random Walks for Path Estimation
This paper describes a graph-spectral method for path estimation. Our aim is to find a maximum probability path through a lattice of pixel sites. We characterise the path recovery problem using a site transition matrix. A graph-spectral analysis of the transition matrix reveals how the maximum probability path can be located using an eigenvector of the associated normalised affinity matrix. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sequential Analysis
سال: 2012
ISSN: 0747-4946,1532-4176
DOI: 10.1080/07474946.2012.652014